Revised Version A GROEBNER BASIS FOR THE 2 × 2

نویسندگان

  • TOMAŽ KOŠIR
  • B. A. SETHURAMAN
چکیده

In an earlier paper ([6]) we had begun a study of the components and dimensions of the spaces of (k − 1)-th order jets of the classical determinantal varieties: these are the varieties Z m,n r,k obtained by considering generic m × n (m ≤ n) matrices over rings of the form F [t]/(t k), and for some fixed r, setting the coefficients of powers of t of all r × r minors to zero. In this paper, we consider the case where r = k = 2, and provide a Groebner basis for the ideal I m,n 2,2 which defines the tangent bundle to the classical 2 × 2 determinantal variety. We use the results of these Groebner basis calculations to describe the components of the varieties Z

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A probabilistic and deterministic modular algorithm for computing Groebner basis over $\Q$

Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over Q, but it does not seem to be popular among CAS implementers. In this paper, I will show how to check a candidate Groebner basis (obtained by reconstruction of several Groebner basis modulo distinct prime ...

متن کامل

Groebner Basis Under Composition I

The main question of this paper is: When does Groebner basis computation (Buchberger, 1965, 1985) commute with composition? More precisely, let F be a finite set of polynomials in the variables x1, . . . , xn, and let G be a Groebner basis of the ideal generated by F under some term ordering. Let Θ = (θ1, . . . , θn) be a list of n polynomials in the variables x1, . . . , xn. Let F ∗ be the set...

متن کامل

Groebner Bases and the Cohomology of Grassmann Manifolds with Application to Immersion

LetGk,n be the Grassmannmanifold of k-planes inR . Borel showed that H∗ (Gk,n; Z2) = Z2 [w1, . . . , wk] /Ik,n where Ik,n is the ideal generated by the dual Stiefel-Whitney classes wn+1, . . . , wn+k. We compute Groebner bases for the ideals I2,2i−3 and I2,2i−4 and use these results along with the theory of modi ed Postnikov towers to prove new immersion results, namely that G2,2i−3 immerses in...

متن کامل

Geometric Ideas for Cryptographic Equation Solving in Even Characteristic

The GeometricXL algorithm is a geometrically invariant version of the XL algorithm that uses polynomials of a much smaller degree than either a standard Groebner basis algorithm or an XL algorithm for certain multivariate equation systems. However, the GeometricXL algorithm as originally described is not well-suited to fields of even characteristic. This paper discusses adaptations of the Geome...

متن کامل

GB-hash : Hash Functions Using Groebner Basis

In this paper we present an improved version of HF-hash [DMS] viz., GB-hash: Hash Functions Using Groebner Basis. In case of HF-hash, the compression function consists of 32 polynomials with 64 variables, which were taken from the first 32 polynomials of hidden field equations challenge-1 by forcing last 16 variables as 0. In GB-hash we have designed the compression function in such way that th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004